A personalized search using a semantic distance measure in a graph-based ranking model

نویسندگان

  • Mariam Daoud
  • Lynda Tamine
  • Mohand Boughanem
چکیده

The goal of search personalization is to tailor search results to individual users by taking into account their profiles, which include their particular interests and preferences. As these latter are multiple and changing over time, personalization becomes effective when the search process takes into account the current user interest. This paper presents a search personalization approach that models a semantic user profile and focuses on a personalized document ranking model based on an extended graph-based distance measure. Documents and user profiles are both represented by graphs of concepts issued from predefined web ontology, namely the ODP. Personalization is then based on reordering the search results of related queries according to a graph-based document ranking model. This former is based on using a graph-based distance measure combining Minimum Common Supergraph (MCS) and maximum common subgraph (mcs) between the document and the user profile graphs. We extend this measure in order to take into account a semantic recovery at exact and approximate concept level matching. Experimental results show the effectiveness of our personalized graph-based ranking model compared to Yahoo and to different personalized ranking models performed using classical graph-based measures or vector space similarity measures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Personalized Graph-Based Document Ranking Model Using a Semantic User Profile

The overload of the information available on the web, held with the diversity of the user information needs and the ambiguity of their queries have led the researchers to develop personalized search tools that return only documents that meet the user profile representing his main interests and needs. We present in this paper a personalized document ranking model based on an extended graph-based...

متن کامل

Personalization of Search on Structured Data

Recent research on semantic search methods has given rise to a number of large graph-based knowledge repositories which could form the basis of semantic search engines, fully capable of finding and ranking facts. Similar to traditional Web search, the ranking provided may prove to be satisfactory on average, however just as in other types of knowledge bases, personalization could be highly bene...

متن کامل

مدل جدیدی برای جستجوی عبارت بر اساس کمینه جابه‌جایی وزن‌دار

Finding high-quality web pages is one of the most important tasks of search engines. The relevance between the documents found and the query searched depends on the user observation and increases the complexity of ranking algorithms. The other issue is that users often explore just the first 10 to 20 results while millions of pages related to a query may exist. So search engines have to use sui...

متن کامل

Personalizing the Search for Knowledge

Recent work on building semantic search engines has given rise to large graph-based knowledge repositories and facilities for querying them and more importantly, ranking the results. While the ranking provided may prove to be acceptable in general, for a truly satisfactory search experience, it is necessary to tailor the results according to the user’s interest. In this paper, we address the is...

متن کامل

A New Hybrid Method for Web Pages Ranking in Search Engines

There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Information Science

دوره 37  شماره 

صفحات  -

تاریخ انتشار 2011